Watson-Crick automata: determinism and state complexity
نویسندگان
چکیده
Watson-Crick automata are finite state automata working on double-stranded tapes, introduced to investigate the potential of DNA molecules for computing. In this paper, we continue the investigation of descriptional complexity of Watson-Crick automata initiated in [9]. In particular, we show that any finite language as well as any unary regular language can be recognized by a Watson-Crick automaton with only two and respectively three states. Also, we formally define the notion of determinism for these systems. Contrary to the case of non-deterministic Watson-Crick automata, we show that for deterministic ones, the complementarity relation plays a major role in the acceptance power of these systems.
منابع مشابه
On the descriptional complexity of Watson-Crick automata
Watson–Crick automata are finite state automata working on double-stranded tapes, introduced to investigate the potential of DNA molecules for computing. In this paper, we continue the investigation of descriptional complexity ofWatson–Crick automata initiated by Păun et al. [A. Păun, M. Păun, State and transition complexity of Watson–Crick finite automata, in: G. Ciobanu, G. Paun (Eds.), Funda...
متن کاملWatson-Crick Quantum Finite Automata
one-way quantum finite automata are reversible in nature, which greatly reduces its accepting property. In fact, the set of languages accepted by one-way quantum finite automata is a proper subset of regular languages. In this paper, we replace the tape head of one-way quantum finite automata with DNA double strand and name the model Watson-Crick quantum finite automata. The noninjective comple...
متن کاملEquivalence of Subclasses of Two-Way Non-Deterministic Watson Crick Automata
Watson Crick automata are finite automata working on double strands. Extensive research work has already been done on non deterministic Watson Crick automata and on deterministic Watson Crick automata. Parallel Communicating Watson Crick automata systems have been introduced by E. Czeziler et al. In this paper we discuss about a variant of Watson Crick automata known as the two-way Watson Crick...
متن کاملOn the power of parallel communicating Watson-Crick automata systems
Parallel communicating Watson-Crick automata systems were introduced in [2] as possible models of DNA computations. This combination of Watson-Crick automata and parallel communicating systems comes as a natural extension due to the new developments in DNA manipulation techniques. It is already known, see [5], that for Watson-Crick finite automata, the complementarity relation plays no active r...
متن کاملParallel Communicating Watson-Crick Automata Systems
Watson-Crick automata are finite state automata working on doublestranded tapes, introduced to investigate the potential of DNA molecules for computing. In this paper we introduce the concept of parallel communicating Watson-Crick automata systems. It consists of several Watson-Crick finite automata parsing independently the same input and exchanging information on request, by communicating sta...
متن کامل